Optimal appointment scheduling with a stochastic server: Simulation based K-steps look-ahead selection method
نویسندگان
چکیده
منابع مشابه
Optimal outpatient appointment scheduling.
In this paper optimal outpatient appointment scheduling is studied. A local search procedure is derived that converges to the optimal schedule with a weighted average of expected waiting times of patients, idle time of the doctor and tardiness (lateness) as objective. No-shows are allowed to happen. For certain combinations of parameters the well-known Bailey-Welch rule is found to be the optim...
متن کاملA stochastic model for project selection and scheduling problem
Resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. In this study, budget, investment costs and earnings are considered to be stochastic. The objectives are maximizing net present values of selected projects and minimizing v...
متن کاملThe Optimal Look-Ahead Policy for Admission to a Single Server System
This paper considers a service system with a single server, finite waiting room, and a renewal arrival process. Customers who arrive while the server is busy are lost. Upon completing service, the server chooses between two actions: either he immediately starts a new service, provided a customer is present, or he admits the newly arrived customer to the system, but delays service pending the ne...
متن کاملSingle machine stochastic appointment sequencing and scheduling
We develop algorithms for a single machine stochastic appointment sequencing and scheduling problem with waiting time, idle time, and overtime costs. This is a basic stochastic scheduling problem that has been studied in various forms by several previous authors. Applications for this problem cited previously include scheduling of surgeries in an operating room (Denton, 2007, Denton and Gupta,2...
متن کاملAn Optimal Strategy in Multi-Server Stochastic Scheduling
Identical components are available for use in a piece of machinery. The number of components needed to operate the machine is a function of time and the lifetime of each component is described by a known probability distribution. Once a certain number of components have failed there will not be enough left o operate the machine. We find a strategy which for certain lifetime distributions delays...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2018
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2017.7.002